Classifying scheduling policies with respect to unfairness in an M/GI/1

Asymptotic convergence of scheduling policies with respect to slowdown

We explore the performance of an M/GI/1 queue under various scheduling policies from the perspective of a new metric: the slowdown experienced by largest jobs. We consider scheduling policies that bias against large jobs, towards large jobs, and those that are fair, e.g., Processor-Sharing. We prove that as job size increases to infinity, all work conserving policies converge almost surely with...

Revisiting unfairness in Web server scheduling

This paper uses trace-driven simulation to study the unfairness properties of Web server scheduling strategies, such as Processor Sharing (PS) and Shortest Remaining Processing Time (SRPT). We use a general-purpose probe-based sampling approach to estimate the mean and variance of the job response time for different job sizes, for arbitrary arrival processes and service time distributions. The ...

a comparison of teachers and supervisors, with respect to teacher efficacy and reflection

supervisors play an undeniable role in training teachers, before starting their professional experience by preparing them, at the initial years of their teaching by checking their work within the proper framework, and later on during their teaching by assessing their progress. but surprisingly, exploring their attributes, professional demands, and qualifications has remained a neglected theme i...

Small submodules with respect to an arbitrary submodule

Let $R$ be an arbitrary ring and $T$ be a submodule of an $R$-module $M$. A submodule $N$ of $M$ is called $T$-small in $M$ provided for each submodule $X$ of $M$, $Tsubseteq X+N$ implies that $Tsubseteq X$. We study this mentioned notion which is a generalization of the small submodules and we obtain some related results.

Decision criteria in risk analysis : an application of stochastic dominance with respect to a function